منابع مشابه
Optimal Routing for Multiclass Networks
Overall optimal routing is considered along with individually optimal routing for networks with nodes interconnected in a generally configured manner and with multiple classes of users. The two problems are formulated, and we discuss the mutual equivalence between the problems, the existence and uniqueness of solutions, and the relation between the formulations with path and link flow patterns....
متن کاملHeat-Diffusion: Optimal Dynamic Routing for Multiclass Multihop Wireless Networks
A new routing policy, named Heat-Diffusion (HD), is developed for multiclass, multihop wireless networks subject to stochastic arrivals, randomly varying topology, and channel interference. The new policy uses only current queue backlogs and current channel states, without requiring the knowledge of topology and arrivals. We show that HD is throughput-optimal in the sense that it stabilizes all...
متن کاملEquilibria for Multiclass Routing in Multi-Agent Networks
We study optimal static routing problems in open multiclass networks with state-independent arrival and service rates. Our goal is to study the uniqueness of optimal routing under different scenarios. We consider first the overall optimal policy that is the routing policy whereby the overall mean cost of a job is minimized. We then consider an individually optimal policy whereby jobs are routed...
متن کاملOptimal learners for multiclass problems
The fundamental theorem of statistical learning states that for binary classification problems, any Empirical Risk Minimization (ERM) learning rule has close to optimal sample complexity. In this paper we seek for a generic optimal learner for multiclass prediction. We start by proving a surprising result: a generic optimal multiclass learner must be improper, namely, it must have the ability t...
متن کاملOptimal routing on complex networks
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Operations Research
سال: 2011
ISSN: 1687-9147,1687-9155
DOI: 10.1155/2011/645954